cient Spectral Techniques for Sequential ATPG

نویسندگان

  • Ashish Giani
  • Shuo Sheng
  • Michael S Hsiao
  • Vishwani D Agrawal
چکیده

We present a new test generation procedure for sequen tial circuits using spectral techniques Iterations of lter ing via compaction and spectral analysis of the ltered test set are performed for each primary input extracting in herent spectral information embedded within the test se quence This information when viewed in the frequency domain reveals the characteristics of the input spectrum These spectral characteristics are then used to generate future vectors We develop a fault dropping technique to speed up the process We show that very high fault cov erages and small vector sets are consistently obtained in short execution times for sequential benchmark circuits

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Enhancing Deterministic Sequential ATPG

This thesis presents four different techniques for improving the average-case performance of deterministic sequential circuit Automatic Test Patterns Generators (ATPG). Three techniques make use of information gathered during test generation to help identify more unjustifiable states with higher percentage of “don’t care” value. An approach for reducing the search space of the ATPG was introduc...

متن کامل

Simulation Based Sequential Circuit Automated Test Pattern Generation

The aim with this paper is to design a high efficient sequential ATPG on single stack-at fault model. A new approach for sequential circuit test generation is proposed in this paper. With combining the advantage of logic simulation based ATPG and fault simulation based ATPG, higher fault coverage and shorter test sequential length are achieved for benchmark circuit instead of pure logic or faul...

متن کامل

Improving topological ATPG with symbolic techniques

This paper presents a new approach to Automatic Test Pattern Generation for sequential circuits. Traditional topological algorithms nowadays are able to deal with very large circuits, but often fail when highly sequential subnetworks are found. On the other hand, symbolic techniques based on Binary Decision Diagrams proved themselves very efficient on small or medium circuits, no matter their s...

متن کامل

Efficient Sequential ATPG Based on Partitioned Finite-State-Machine Traversal

We present a new automatic test pattern generation algorithm for sequential circuits by traversing the partitioned state spaces. The new features include: (1) nondisjoint state groups are obtained such that two different state groups may have common flip-flops, (2) partial state transition graphs (STGs) are constructed at run time for each state group, (3) spectral information for state variabl...

متن کامل

Efficient Sequential ATPG for Functional RTL Circuits

We present an efficient register-transfer level automatic test pattern generation (ATPG) algorithm. First, our ATPG generates a series of sequential justification and propagation paths for each RTL primitive via a deterministic branch-and-bound search process, called a test environment. Then the precomputed test vectors for the RTL primitives are plugged into the generated test environments to ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004